Good permutations for scrambled Halton sequences in terms of L2-discrepancy
نویسندگان
چکیده
One of the best known low-discrepancy sequences, used by many practitioners, is the Halton sequence. Unfortunately, there seems to exist quite some correlation between the points from the higher dimensions. A possible solution to this problem is the so-called scrambling. In this paper, we give an overview of known scrambling methods, and we propose a new way of scrambling which gives good results compared to the others in terms of L2-discrepancy. On top of that, our new scrambling method is very easy to generate.
منابع مشابه
Random and Deterministic Digit Permutations of the Halton Sequence*
The Halton sequence is one of the classical low-discrepancy sequences. It is effectively used in numerical integration when the dimension is small, however, for larger dimensions, the uniformity of the sequence quickly degrades. As a remedy, generalized (scrambled) Halton sequences have been introduced by several researchers since the 1970s. In a generalized Halton sequence, the digits of the o...
متن کاملOn the Performance of the Shuffled Halton Sequence in the Estimation of Discrete Choice Models
The area of travel demand analysis has in recent years been greatly enriched by the development of new model forms that can accommodate complex patterns of substitution and taste variation. However, this added flexibility comes at a cost of greater complexity in estimation, to the degree that these models need to be estimated through simulation. While basic Monte-Carlo integration can lead to a...
متن کاملA note on scrambled Halton sequences
Halton’s low discrepancy sequence is still very popular in spite of its shortcomings with respect to the correlation between points of two-dimensional projections for large dimensions. As a remedy, several types of scrambling and/or randomizations for this sequence have been proposed. We examine empirically some of these by calculating their L4and L2-discrepancies (D* resp. T*), and by performi...
متن کاملL2 discrepancy of generalized two-dimensional Hammersley point sets scrambled with arbitrary permutations
The L2 discrepancy is a quantitative measure for the irregularity of distribution of a finite point set. In this paper we consider the L2 discrepancy of so-called generalized Hammersley point sets which can be obtained from the classical Hammersley point sets by introducing some permutations on the base b digits. While for the classical Hammersley point set it is not possible to achieve the opt...
متن کاملImproved Halton sequences and discrepancy bounds
For about fifteen years, the surprising success of quasi-Monte Carlo methods in finance has been raising questions that challenge our understanding of these methods. At the origin are numerical experiments performed with so-called GSobol’ and GFaure sequences by J. Traub and his team at Columbia University, following the pioneering work of S. Tezuka in 1993 on generalizations of Niederreiter (t...
متن کامل